2 . numerais system of propositional calculus nend netwrk deals with data , but it is a formula set in proposihonal calculus 命題邏輯系統(tǒng)的數(shù)字化神經(jīng)網(wǎng)絡(luò)的處理對(duì)象是數(shù)據(jù),而命題邏輯系統(tǒng)的處理對(duì)象是命題公式集。
In automated theorem pidving , auomated reasoning methods of propositional calculus provide with edtersal naoning method for other iogic sywt 在自動(dòng)推理理論與應(yīng)用的研究中,命題邏輯系統(tǒng)中的方法和內(nèi)容具有廣泛的適用性。
The medium logic propositional calculus system mpm and the medium logic predicate calculus system mfm are new logic systems . they are fit for dealing with incomplete information 中介邏輯命題演算系統(tǒng)mp ~ m和中介邏輯謂詞演算系統(tǒng)mf ~ m是一種適用于處理不完全信息的新的邏輯系統(tǒng)。
The conclusion points out tha evaltalon propositional calculus is sbole extension of hsitional calculus . mnle , the authr deeply studies to get ch medl sets , and gets some conclusion 同時(shí),在已有關(guān)于horn近似的快速推理研究的基礎(chǔ)上,對(duì)如何盡快尋找模型集中的極小模型進(jìn)行更深入的研究,得出若干結(jié)論。
In this paper , a new type algebra is introduced , it is the algebraic abstract of mpm system just as boolean algebra is the algebraic abstract of 2 - valued propositional calculus . the main purpose of this paper is to investigate the various properties of the new algebra . in addition , this paper constructs an axiom set based on the medium logic propositional calculus system mpm , and gives a proof of its completeness 本文通過(guò)對(duì)mpm中介邏輯命題演算系統(tǒng)進(jìn)行代數(shù)抽象,建立了一個(gè)新的代數(shù)系統(tǒng),討論了該代數(shù)系統(tǒng)的性質(zhì),并利用該代數(shù)系統(tǒng)的代數(shù)性質(zhì)構(gòu)造了中介命題演算系統(tǒng)mpm上的一個(gè)公理完備集合,使用該公理集合可以方便的推導(dǎo)出mpm上的等值和互推公式,這對(duì)于處理不完全信息數(shù)據(jù)庫(kù)的查詢(xún)優(yōu)化有著重要作用。
The medium logic propositional calculus system mpm and the medium logic predicate calculus system mfm is a new logic system modified from the existing medium logic system . this system is fit for dealing with incomplete information . it can act as the theory foundation for dealing with incomplete information 中介邏輯命題演算系統(tǒng)mpm和中介邏輯謂詞演算系統(tǒng)mfm是在改造原有的中介邏輯系統(tǒng)的基礎(chǔ)上提出的一種新的邏輯系統(tǒng),該邏輯系統(tǒng)特別適用于處理不完全信息,可以作為處理不完全信息的理論基礎(chǔ)。
英文解釋
a branch of symbolic logic dealing with propositions as units and with their combinations and the connectives that relate them 同義詞:propositional logic,
百科解釋
In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules and axioms allows certain formulas to be derived, called theorems; which may be interpreted as true propositions.